package com.hr.牛客网剑指offer;

/**
 * @author zhz
 * @date 2020/08/22
 **/
public class JZ7_斐波那契数列 {

    public int Fibonacci(int n) {
        if (n==0 || n==1){
            return n;
        }
        int[] dp=new int[n+1];
        dp[0]=0;
        dp[1]=1;
        for (int i = 2; i < n+1; i++) {
            dp[i]=dp[i-1]+dp[i-2];
        }
        return dp[n];
    }
}
